Branching Constraint Satisfaction Problems for Solutions Robust under Likely Changes
نویسندگان
چکیده
Many applications of CSPs require partial solutions to be found before all the information about the problem is available. We examine the case where the future is partially known, and where it is important to make decisions in the present that will be robust in the light of future events. We introduce the branching CSP to model these situations, incorporating some elements of decision theory, and describe an algorithm for its solution that combines forward checking with branch and bound search. We also examine a simple thresholding method which can be used in conjunction with the forward checking algorithm, and we show the trade-off between time and solution quality.
منابع مشابه
Uncertainty in dynamic constraint satisfaction problems
Many real life problems that can be modeled as Constraint Satisfaction Problems (CSPs) come from uncertain and dynamic environments, so the original solution found might become invalid after changes. Here, we study the problem of finding robust solutions for CSPs under the assumptions that domains are significantly ordered and that changes take the form of restrictions or relaxations at the bor...
متن کاملScheduling for an Uncertain Future with Branching Constraint Satisfaction Problems
Agents which schedule tasks must deal with problems that change as time progresses, often while the problem is being solved. In this paper, we assume that the agent does not blindly react to events, but uses knowledge of likely changes to make decisions in the present that will facilitate future actions. To solve this problem, we introduce the branching CSP, a new variant of the constraint sati...
متن کاملReformulating Dynamic Linear Constraint Satisfaction Problems as Weighted CSPs for Searching Robust Solutions
Constraint programming is a successful technology for solving combinatorial problems modeled as constraint satisfaction problems (CSPs). Many real life problems come from uncertain and dynamic environments, which means that the initial description of the problem may change during its execution. In these cases, the solution found for a problem may become invalid. The search of robust solutions f...
متن کاملCounting-Based Search: Branching Heuristics for Constraint Satisfaction Problems
Designing a search heuristic for constraint programming that is reliable across problem domains has been an important research topic in recent years. This paper concentrates on one family of candidates: counting-based search. Such heuristics seek to make branching decisions that preserve most of the solutions by determining what proportion of solutions to each individual constraint agree with t...
متن کاملRobust solutions for constraint satisfaction and optimisation under uncertainty
We develop a framework for finding robust solutions of constraint programs. Our approach is based on the notion of fault tolerance. We formalise this concept within constraint programming, extend it in several dimensions and introduce some algorithms to find robust solutions efficiently. When applying constraint programming to real world problems we often face uncertainty. Whilst reactive metho...
متن کامل